An Effective Montogomery Algorithm Using Multiplier Circuits

Modular exponentiation is the cornerstone computation in public key cryptography systems such as RSA cryptosystems .The operation is time consuming for large operands. This paper describes the characteristics of three architectures designed to implement modular exponentiation using the fast binary method: the first field programmable gate array (FPGA) prototype has a sequential architecture, the second has a parallel architecture, and the third has a systolic array based architecture The paper compares the three prototypes as well as Blum and Paar ís implementation using the time× area classic factor. All three prototypes implement the modular multiplication using the popular Montgomery algorithm.